Staff Scheduling Problem by means of Optimization Algorithms

Our application is placed in the domain of automatic generation of timetables. The generation of timetables is the assignment of employees to tasks in the goal of schedule during one fixed period, in general a week. This problem is by its nature a complex problem which requires the resolution of many constraints. Indeed, the SSP are usually addressed to the organization where a set of tasks must be achieved by a group of employees having their own qualifications, constraints and preferences. The organization imposes total regulations and tries to carry out such total objectives them such as the reduction of the total cost or the equitable division of the load of work between the employees. Research in this field gave place to several conference. The results resulting often are adapted to particular professional sectors. In this paper, we propose a general solution not depending on particular sector.